Colorful Subhypergraphs in Uniform Hypergraphs
نویسنده
چکیده
There are several topological results ensuring in any properly colored graph the existence of a colorful complete bipartite subgraph, whose order is bounded from below by some topological invariants of some topological spaces associated to the graph. Meunier [Electron. J. Combin., 2014] presented the first colorful type result for uniform hypergraphs. In this paper, we give some new generalizations of the Zp-Tucker Lemma and by use of them, we improve Meunier’s result and some other colorful results by Simonyi, Tardif, and Zsbán [Electron. J. Combin., 2014] and by Simonyi and Tardos [Electron. J. Combin., 2007] to uniform hypergraphs. Also, we introduce some new lower bounds for the chromatic number and local chromatic number of uniform hypergraphs. A hierarchy between these lower bounds is presented as well.
منابع مشابه
Colorful Subhypergraphs in Kneser Hypergraphs
Using a Zq-generalization of a theorem of Ky Fan, we extend to Kneser hypergraphs a theorem of Simonyi and Tardos that ensures the existence of multicolored complete bipartite graphs in any proper coloring of a Kneser graph. It allows to derive a lower bound for the local chromatic number of Kneser hypergraphs (using a natural definition of what can be the local chromatic number of a uniform hy...
متن کاملEquicovering Subgraphs of Graphs and Hypergraphs
As a variation on the t-Equal Union Property (t-EUP) introduced by Lindström, we introduce the t-Equal Valence Property (t-EVP) for hypergraphs: a hypergraph satisfies the t-EVP if there are t pairwise edge-disjoint subhypergraphs such that for each vertex v, the degree of v in all t subhypergraphs is the same. In the t-EUP, the subhypergraphs just have the same sets of vertices with positive d...
متن کاملThe Lifting of Graphs to 3-uniform Hypergraphs and Some Applications to Hypergraph Ramsey Theory
Given a simple graph Γ, we describe a “lifting” to a 3-uniform hypergraph φ(Γ) that sends the complement of Γ to the complement of φ(Γ). We consider the effects of this lifting on cycles, complete subhypergraphs, and complete subhypergraphs missing a single hyperedge. Our results lead to natural lower bounds for some hypergraph Ramsey numbers.
متن کاملSubhypergraphs in Non-uniform Random Hypergraphs
In this paper we focus on the problem of finding (small) subhypergraphs in a (large) hypergraph. We use this problem to illustrate that reducing hypergraph problems to graph problems by working with the 2-section is not always a reasonable approach. We begin by defining a generalization of the binomial random graph model to hypergraphs and formalizing several definitions of subhypergraph. The b...
متن کاملA counting lemma for sparse pseudorandom hypergraphs
Our main result tells us that mild density and pseudorandom conditions allow one to prove certain counting lemmas for a restricted class of subhypergraphs in a sparse setting. As an application, we present a variant of a universality result of Rödl for sparse, 3-uniform hypergraphs contained in strongly pseudorandom hypergraphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 24 شماره
صفحات -
تاریخ انتشار 2017